Visualization of hyperspectral images on parallel and distributed platform: Apache Spark

The field of hyperspectral image storage and processing has undergone a remarkable evolution in recent years. The visualization of these images represents a challenge as the number of bands exceeds three bands, since direct visualization using the trivial system red, green and blue (RGB) or hue, saturation and lightness (HSL) is not feasible. One potential solution to resolve this problem is the reduction of the dimensionality of the image to three dimensions and thereafter assigning each dimension to a color. Conventional tools and algorithms have become incapable of producing results within a reasonable time. In this paper, we present a new distributed method of visualization of hyperspectral image based on the principal component analysis (PCA) and implemented in a distributed parallel environment (Apache Spark). The visualization of the big hyperspectral images with the proposed method is made in a smaller time and with the same performance as the classical method of visualization

Arabic Text Summarization Challenges using Deep Learning Techniques: A Review

Text summarization is a challenging field in Natural Language Processing due to language modelisation and used techniques to give concise summaries.  Dealing with Arabic language does increase the challenge while taking into consideration the many features of the Arabic language, the lack of tools and resources for Arabic, and the Algorithms adaptation and modelisation. In this paper, we present several researches dealing with Arabic Text summarization applying different Algorithms on several Datasets. We then compare all these researches and we give a conclusion to guide researchers on their further work

An Algebraic Method for Analysing Control Flow of BPMN Models

This paper introduces an approach for formal verification of BPMN models. The incompatible constructs of the BPMN patterns can lead to wrong or incomplete semantics which resulting the behavioral errors such as deadlock and multiple termination. This research is motivated by the need to create a correct business process and in order to generate a more complete formalization of BPMN semantics than existing formalizations. We first introduce the chosen patterns which are the most used in the modelisation of the service-based business processes. Then, we illustrate a definition of the execution semantics of these patterns by using the rules of Max+ Algebra formulas, which have important benefits